Order-Preserving Multiple Pattern Matching in Parallel
نویسندگان
چکیده
The order-preserving multiple pattern matching problem is to find all substrings of T whose relative orders are the same for any in a set patterns. Various sequential algorithms have been studied problems. In this paper, we propose two parallel algorithms, each which uses Aho–Corasick automata and fingerprint tables, respectively. We also present experimental results comparing execution times algorithm on various types time-series data.
منابع مشابه
Order-Preserving Pattern Matching with k Mismatches
We study a generalization of the order-preserving pattern matching recently introduced by Kubica et al. (Inf. Process. Let., 2013) and Kim et al. (submitted to Theor. Comp. Sci.), where instead of looking for an exact copy of the pattern, we only require that the relative order between the elements is the same. In our variant, we additionally allow up to k mismatches between the pattern of leng...
متن کاملBit-Parallel Multiple Pattern Matching
Text matching with errors is a regular task in computational biology. We present an extension of the bit-parallel Wu-Manber algorithm [16] to combine several searches for a pattern into a collection of fixed-length words. We further present an OpenCL parallelization of a redundant index on massively parallel multicore processors, within a framework of searching for similarities with seed-based ...
متن کاملFast Multiple Order-Preserving Matching Algorithms
Given a text T and a pattern P , the order-preserving matching problem is to find all substrings in T which have the same relative orders as P . Order-preserving matching has been an active research area since it was introduced by Kubica et al. [13] and Kim et al. [11]. In this paper we present two algorithms for the multiple order-preserving matching problem, one of which runs in sublinear tim...
متن کاملEfficient Algorithms for the Order Preserving Pattern Matching Problem
Given a pattern x of length m and a text y of length n, both over an ordered alphabet, the order-preserving pattern matching problem consists in finding all substrings of the text with the same relative order as the pattern. It is an approximate variant of the well known exact pattern matching problem which has gained attention in recent years. This interesting problem finds applications in a l...
متن کاملOrder Preserving Pattern Matching on Trees and DAGs
The order preserving pattern matching (OPPM ) problem is, given a pattern string p and a text string t, find all substrings of t which have the same relative orders as p. In this paper, we consider two variants of the OPPM problem where a set of text strings is given as a tree or a DAG. We show that the OPPM problem for a single pattern p of length m and a text tree T of size N can be solved in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2023
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app13085142